A Method for Classification of Convex Polygons

نویسندگان

  • Ping Guo
  • Yan-Xia Wang
چکیده

Based on the planar polygon shape classification, we propose a method—Standardized Binary String Descriptor of Convex Polygon—for classification of convex polygons, making it more precise. Thus, the model database space is pruned and the number of shape models compared with, when doing match query and similarity query, is reduced. Furthermore, the number of equivalence class of convex polygon formula based on SBSDCP classification is presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A method for the enumeration of various classes of column-convex polygons

2 Abstract. We present a new method that allows to enumerate various classes of column-convex polygons, according to their perimeter and their area. The rst step of this method leads to a functional equation which deenes implicitly the generating function of the class under consideration. The second step consists in solving this equation. We apply systematically our method to all the usual clas...

متن کامل

Algorithm for finding the largest inscribed rectangle in polygon

In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...

متن کامل

Polynomial interpolation and cubature over polygons

We have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type) on convex or concave polygons, together with the corresponding interpolatory cubature formulas. The method works by QR and LU factorizations of rectangular Vandermonde matrices on Weakly Admissible Meshes (WAMs) of polygons, constructed by polygon quadrangulation. 2000 AMS subject classification: 65D05...

متن کامل

Visibility Graphs and Deformations of Associahedra

The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P , we construct a polytopal complex analogous to the associahedron based on convex diagonalizations of P . We describe topological properties of this complex and provide realizations based on secondary polytopes. Moreover, using the...

متن کامل

CS 157 : Assignment 6 Douglas R . Lanman 8 May 2006 Problem 1 : Evaluating Convex Polygons

Problem 1: Evaluating Convex Polygons This write-up presents several simple algorithms for determining whether a given set of twodimensional points defines a convex polygon (i.e., a convex hull). In Section 1.1, we introduce the notion of regular polygons and provide examples of both convex and non-convex point sets. Section 1.2 presents an algorithm for ordering a set of points such that a cou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCIT

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2007